Transmuting data associations among data arrangements to facilitate data operations in a system of networked collaborative datasets

ABSTRACT

Various embodiments relate generally to data science and data analysis and computer software and systems to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform configured to transmute associations between data arrangements of different formats or different data models to facilitate data operations, such as queries, configured to enhance, for example, an ingested dataset via transmuted associations as, for example, interrelations among a system of networked collaborative datasets. For example, a method may include identifying a referential indicator, determining an association with a value representative of the referential indicator to an equivalent value representative of another referential indicator associated with a different dataset, transmuting the association to form a transmuted association as a link between the value and the equivalent value, and integrating the link into an ingested data arrangement.

CROSS-REFERENCE TO APPLICATIONS

This application is a continuation application of copending U.S. patentapplication Ser. No. 15/943,629, filed Apr. 2, 2018 and titled,“TRANSMUTING DATA ASSOCIATIONS AMONG DATA ARRANGEMENTS TO FACILITATEDATA OPERATIONS IN A SYSTEM OF NETWORKED COLLABORATIVE DATASETS;” U.S.patent application Ser. No. 15/943,629 is a continuation-in-partapplication of U.S. patent application Ser. No. 15/186,514, filed onJun. 19, 2016, now U.S. Pat. No. 10,102,258 and titled “COLLABORATIVEDATASET CONSOLIDATION VIA DISTRIBUTED COMPUTER NETWORKS;” U.S. patentapplication Ser. No. 15/943,629 is also a continuation-in-partapplication of U.S. patent application Ser. No. 15/186,516, filed onJun. 19, 2016, now U.S. Pat. No. 10,452,677 and titled “DATASET ANALYSISAND DATASET ATTRIBUTE INFERENCING TO FORM COLLABORATIVE DATASETS;” U.S.patent application Ser. No. 15/943,629 is also a continuation-in-partapplication of U.S. patent application Ser. No. 15/454,923, filed onMar. 9, 2017, now U.S. Pat. No. 10,353,911 and titled “COMPUTERIZEDTOOLS TO DISCOVER, FORM, AND ANALYZE DATASET INTERRELATIONS AMONG ASYSTEM OF NETWORKED COLLABORATIVE DATASETS;” U.S. patent applicationSer. No. 15/943,629 is also a continuation-in-part application of U.S.patent application Ser. No. 15/927,004 filed on Mar. 20, 2018 and titled“LAYERED DATA GENERATION AND DATA REMEDIATION TO FACILITATE FORMATION OFINTERRELATED DATA IN A SYSTEM OF NETWORKED COLLABORATIVE DATASETS;” Thisapplication is also a continuation of copending U.S. patent applicationSer. No. 15/943,633, filed Apr. 2, 2018 and titled, “INK-FORMATIVEAUXILIARY QUERIES APPLIED AT DATA INGESTION TO FACILITATE DATAOPERATIONS IN A SYSTEM OF NETWORKED COLLABORATIVE DATASETS;” U.S. patentapplication Ser. No. 15/943,633 is a continuation-in-part application ofU.S. patent application Ser. No. 15/186,514, filed on Jun. 19, 2016, nowU.S. Pat. No. 10,102,258 and titled “COLLABORATIVE DATASET CONSOLIDATIONVIA DISTRIBUTED COMPUTER NETWORKS;” U.S. patent application Ser. No.15/943,633 is a continuation-in-part application of U.S. patentapplication Ser. No. 15/186,516, filed on Jun. 19, 2016, now U.S. Pat.No. 10,452,677 and titled “DATASET ANALYSIS AND DATASET ATTRIBUTEINFERENCING TO FORM COLLABORATIVE DATASETS;” U.S. patent applicationSer. No. 15/943,633 is a continuation-in-part application of U.S. patentapplication Ser. No. 15/454,923, filed on Mar. 9, 2017, now U.S. Pat.No. 10,353,911 and titled “COMPUTERIZED TOOLS TO DISCOVER, FORM, ANDANALYZE DATASET INTERRELATIONS AMONG A SYSTEM OF NETWORKED COLLABORATIVEDATASETS;” U.S. patent application Ser. No. 15/943,633 is acontinuation-in-part application of U.S. patent application Ser. No.15/927,004 filed on Mar. 20, 2018 and titled “LAYERED DATA GENERATIONAND DATA REMEDIATION TO FACILITATE FORMATION OF INTERRELATED DATA IN ASYSTEM OF NETWORKED COLLABORATIVE DATASETS;” all of which is hereinincorporated by reference in its entirety for all purposes.

FIELD

Various embodiments relate generally to data science and data analysis,computer software and systems, and wired and wireless networkcommunications to interface among repositories of disparate datasets andcomputing machine-based entities that seek access to the datasets, and,more specifically, to a computing and data storage platform configuredto transmute associations between data arrangements of different formatsor different data models to facilitate data operations, such as queries,configured to enhance, for example, an ingested dataset via transmutedassociations as, for example, interrelations among a system of networkedcollaborative datasets.

BACKGROUND

Advances in computing hardware and software have fueled exponentialgrowth in the generation of vast amounts of data due to increasedcomputations and analyses in numerous areas, such as in the variousscientific and engineering disciplines, as well as in the application ofdata science techniques to endeavors of good-will (e.g., areas ofhumanitarian, environmental, medical, social, etc.). Also, advances inconventional data storage technologies provide the ability to store theincreasing amounts of generated data. Consequently, traditional datastorage and computing technologies have given rise to a phenomenon inwhich numerous desperate datasets have reached sizes and complexitiesthat tradition data-accessing and analytic techniques are generally notwell-suited for assessing conventional datasets.

Conventional technologies for implementing datasets typically rely ondifferent computing platforms and systems, different databasetechnologies, and different data formats, such as CSV, TSV, HTML, JSON,XML, etc. Further, known data-distributing technologies are notwell-suited to enable interoperability among datasets. Thus, manytypical datasets are warehoused in conventional data stores, which areknown as “data silos.” These data silos have inherent barriers thatinsulate and isolate datasets. Further, conventional data systems anddataset accessing techniques are generally incompatible or inadequate tofacilitate data interoperability among the data silos.

Conventional approaches to generate and manage datasets, whilefunctional, suffer a number of other drawbacks. For example,conventional data implementation typically may require manualimportation of data from data files having “free-form” data formats.Without manual intervention, such data may be imported into data fileswith inconsistent or non-standard data structures or relationships.Thus, data practitioners generally are required to intervene to manuallystandardize the data arrangements. Further, manual intervention by datapractitioners is typically required to decide how to group data based ontypes, attributes, etc. Manual interventions for the above, as well asother known conventional techniques, generally cause sufficient frictionto dissuade the use of such data files. Thus, valuable data and itspotential to improve the public well-being may be thwarted.

Moreover, traditional dataset generation and management are notwell-suited to reducing efforts by data scientists and datapractitioners to interact with data, such as via user interface (“UP”)metaphors, over complex relationships that link groups of data in amanner that serves their desired objectives, as well as the applicationof those groups of data to third party (e.g., external) applications orendpoints processes, such as statistical applications.

Other drawbacks in conventional approaches to traditional data storageand computing technologies include implementations of indexes to join orcombine data in different tables using relational database techniques.During data operations, such as relational-based queries applied totables, an index value representing a value needs to be computed andcompared against the other values to search for queried data in one ormore tables. Examples of joining two tables related by a column includeuse indexed associations between primary and foreign key. Computationsto employ an index association increases as the number of indexassociations increases, thereby impeding optimal performance ofcomputing resources, especially in instances in which index associationsand corresponding computational comparisons are performed during one ormore queries, such as each query.

Thus, what is needed is a solution for facilitating techniques tooptimize data operations applied to datasets, without the limitations ofconventional techniques.

BRIEF DESCRIPTION OF THE DRAWINGS

Various embodiments or examples (“examples”) of the invention aredisclosed in the following detailed description and the accompanyingdrawings:

FIG. 1 is a diagram depicting an example of a dataset ingestioncontroller configured to transmute relationships among data in datasetsto enhance querying and retrieving results thereof, according to someembodiments;

FIG. 2 is a diagram depicting an example of an atomized data point,according to some embodiments;

FIG. 3 is a diagram depicting an example of formatting a dataset to forma transmuted association, according to some examples;

FIG. 4 is a diagram depicting a dataset query engine configured toimplement a query via a transmuted association against a graph dataarrangement, according to some examples;

FIG. 5 is a flow diagram depicting an example of transmutingrelationships among data during data ingestion to enhance querying andretrieving results thereof, according to some embodiments;

FIG. 6 is a diagram depicting examples of one or more auxiliary querygenerators for enriching ingested datasets, according to some examples;

FIG. 7 is a flow diagram depicting an example of implementinglink-formative queries to enhance datasets, according to someembodiments;

FIGS. 8A to 8D are diagrams depicting computerized tools of a userinterface to cause formation of transmuted associations to facilitatelink-formative queries, according to some examples; and

FIG. 9 illustrates examples of various computing platforms configured toprovide various functionalities to components of a collaborative datasetconsolidation system, according to various embodiments.

DETAILED DESCRIPTION

Various embodiments or examples may be implemented in numerous ways,including as a system, a process, an apparatus, a user interface, or aseries of program instructions on a computer readable medium such as acomputer readable storage medium or a computer network where the programinstructions are sent over optical, electronic, or wirelesscommunication links. In general, operations of disclosed processes maybe performed in an arbitrary order, unless otherwise provided in theclaims.

A detailed description of one or more examples is provided below alongwith accompanying figures. The detailed description is provided inconnection with such examples, but is not limited to any particularexample. The scope is limited only by the claims, and numerousalternatives, modifications, and equivalents thereof. Numerous specificdetails are set forth in the following description in order to provide athorough understanding. These details are provided for the purpose ofexample and the described techniques may be practiced according to theclaims without some or all of these specific details. For clarity,technical material that is known in the technical fields related to theexamples has not been described in detail to avoid unnecessarilyobscuring the description.

FIG. 1 is a diagram depicting an example of a dataset ingestioncontroller configured to transmute relationships among data in datasetsto enhance querying and retrieving results thereof, according to someembodiments. Diagram 100 depicts an example of a collaborative datasetconsolidation system 110 that may be configured to consolidate one ormore datasets to form collaborative datasets including data to enrichdatasets by accessing via, for example, transmuted associations toaccess a community of user datasets external to a dataset 105 a, whichmay be associated with a user account implemented via computing device114 b for a user 114 a.

Collaborative dataset consolidation system 110 may be configured toconsolidate one or more datasets to form collaborative datasets. Acollaborative dataset, according to some non-limiting examples, is a setof data that may be configured to facilitate data interoperability overdisparate computing system platforms, architectures, and data storagedevices. Further, a collaborative dataset may also be associated withdata configured to establish one or more associations (e.g., metadata)among subsets of dataset attribute data for datasets and multiple layersof layered data, whereby attribute data may be used to determinecorrelations (e.g., data patterns, trends, etc.) among the collaborativedatasets.

Further, collaborative dataset consolidation system 110 may beconfigured to convert a dataset in a first format (e.g., a tabular datastructure or an unstructured data arrangement) into a second format(e.g., a graph), and is further configured to interrelate data between atable and a graph, whereby at least one association between multipletables may be transmuted to form a transmuted association betweenmultiple graphs. Data 101 a may be received in the following examples ofdata formats: CSV, XML, JSON, XLS, MySQL, binary, free-form,unstructured data formats (e.g., data extract from a PDF file usingoptical character recognition), etc., among others. Therefore, dataoperations, such as queries, that are designed for either a tabular orgraph data structure may be implemented to access data in both formatsor data arrangements. For example, a query applied to a collaborativedataset may be accomplished using either a query designed to access atabular or relational data arrangement (e.g., a SQL query or variantthereof) or another query designed to access a graph data arrangement(e.g., a SPARQL operation or a variant thereof), which may include datafor a collaborative dataset. Further, a query designed to access atabular data arrangement may be applied differently to, or computeddifferently, to access a graph data arrangement, at least in oneexample. Therefore, a collaborative dataset of equivalent data may beconfigured to be accessible by different queries and programminglanguages, according to some examples.

Collaborative dataset consolidation system 110 is shown in this exampleto include a dataset ingestion controller 120 and a dataset attributemanager 161, either of which, or both, may be configured to identifyand/or form transmuted associations between dataset 105 a and one ormore other datasets 115 a associated with, for example, another format(e.g., a graph data arrangement), which may be stored in repository 140.Collaborative dataset consolidation system 110 may present a correlationvia, for example, computing device 114 b to provide dataset-relatedinformation to user 114 a. Computing device 114 a may be configured tointeroperate with collaborative dataset consolidation system 110 toperform any number of data operations, including queries overinterrelated or linked datasets. Thus, a community of users 114 a and108 a, as well as any other participating user, may discover, share,manipulate, and query dataset-related information of interest inassociation with collaborative datasets. Collaborative datasets, with orwithout associated dataset attribute data, may be used to facilitateeasier collaborative dataset interoperability (e.g., consolidation)among sources of data that may be differently formatted at origination.

To illustrate formation of a transmuted association, consider an examplein which dataset ingestion controller 120 receives data 101 arepresenting a dataset 105 a, whereby dataset 105 a, while beingdepicted as a being formatted a table in data 101 a, may be disposed inany data format, arrangement, structure, etc., or may be unstructured.Dataset ingestion controller 120 may arrange data in dataset 105 a intoa first data arrangement, or may identify that data in dataset 105 a asbeing disposed in a data arrangement, such as a first data arrangement.In this example, dataset 105 a may be disposed in a tabular dataarrangement that format converter 137 may convert into a second dataarrangement, such as a graph data arrangement 142 a. As such, data in afield (e.g., a unit of data in a cell at a row and column) of a tablemay be disposed in association with a node in a graph (e.g., as a unitof data as linked data). A data operation (e.g., a query) may be appliedas either a query against a tabular data arrangement (e.g., based on arelational data model) or graph data arrangement (e.g., based on a graphdata model, such using RDF). Since equivalent data disposed in both afield of a table and a node of a graph, either the table or the graphmay be used to perform queries and other data operations. Similarly,data datasets disposed in one or more other graph data arrangements 142b may be disposed or otherwise mapped (e.g., linked) as a dataset into atabular data arrangement 115 a.

Data analyzer 130 may be configured to identify a referential indicator113 a for at least a subset of dataset 105 a and another referentialindicator 123 a for at least another subset of dataset 115 a. Dataset115 a may be different than dataset 105 a (e.g., at least a portion ofdataset 115 a may be stored or generated external to collaborativedataset consolidation system 110 or repository 140). In some examples,data analyzer 130 may be configured to identify a value 116 a andanother value 116 b that may be equivalent, and an association may beformed between values 116 a and 116 b. In at least one case, one ofvalues 116 a and 116 b is a unique value. As shown, value 116 a in a rowof dataset 105 a, as a referential indicator, may be used to referencevia 106 to value 116 b, which, in turn, also may be used as areferential indicator back to value 116 a. Note, too, that value 116 ain a row of dataset 105 a may be used to employ an identifier of the rowas reference 106 (or any portion of dataset 105 a) to another row thatincludes value 116 b (or any portion of dataset 115 a). In someexamples, a subset of dataset 105 a may include one or more columns thatinclude one or more referential indicators 113 a, whereas a subset ofdataset 115 a may include one or more columns that include one or morereferential indicators 123 a.

According to some examples, dataset analyzer 130 and any of itscomponents, including inference engine 132, may be configured to analyzevalues 116 a and 116 b to detect or determine equivalency (e.g., duringingestion) and whether one of values 116 a and value 116 b may be usedas a reference indicator to the other. For example, inference engine 132may be configured to analyze data to determine or infer that values 116a and 116 b are equivalent (e.g., as equivalent numbers, equivalentstrings, equivalent classifications, such as data values being zipcodes, equivalent data types, etc., or any other equivalent datasetattribute). In the example shown, inference engine 132 (and/or dataclassifier 124) may determine or infer that data values in column 113 amay include data classified as “zip codes,” whereby data 101 d may betransmitted to a user interface, such as data ingestion interface 102,to confirm whether column data 113 a includes zip codes of a datasetpreview 104 for dataset 105 a. Selection device 179 may be used toreceive an input via interface 106 as to whether column 113 a includeszip codes (e.g., via selection of user input 171) or not (e.g., viaselection of user input 173). A user may confirm formation ofassociation 107 via data 101 d. In alternative implementations, adetermination of zip codes associations may be predicted orprobabilistically determined by performing various computations, bymatching data patterns, etc. For example, equivalency of values may bedetermined or predicted based on statistical computations, includingBayesian techniques, deep-learning techniques, etc. In view of theforegoing, data ingestion interface 102 may facilitate data equivalencydeterminations and dataset enrichment for dataset 105 a “in-situ” or“in-line” (e.g., in real time or near real time) to enhance expansion ofdata in atomized dataset generation during the dataset ingestion and/orgraph formation processes with, for example, formation of a transmutedassociation.

Further, data analyzer 130 may be configured to determine or form anassociation 107 between referential indicator 123 a and referentialindicator 123 b, and, thus, between value 116 a and another value 116 b.In some examples, one of one or more associations 107 between a uniquevalue 116 a may be determined or formed with one or more equivalentvalues 116 b (or conversely). According to some examples, association107 may include an indexed-based association, whereby one of values 116a and 116 b may be stored for a tabular data arrangement as an indexthat may be used to relate (e.g., join) data from one or more tablesusing relational database techniques. During data operations, such asqueries, performed on tabular data arrangements of datasets 105 a and115 a, may implement an index value representing one of values 116 a and116 b for comparing against (e.g., as an equality-determination) theother value to search for queried data. According to some examples,referential indicator 113 a (and/or the data values therein, such asvalue 116 a) may be referred to, or implemented as, a primary key,whereas referential indicator 123 a (and/or the data values therein,such as value 116 b) may be referred to, or implemented as, a foreignkey. Or, conversely, referential indicator 123 a may be a primary keyand referential indicator 113 a may be a foreign key.

Data ingestion controller 120 and/or any of its constituent componentsmay be configured to transmute association 107 to form a transmutedassociation as a link 111 between value 116 a (as one of referentialindicator 113 a) and value 116 b (as one of referential indicator 123a). As shown, transmuted association 107 may form link 111 between, forexample, node 199 a and node 199 b, which include data representingvalue 116 a and value 116 b, respectively. Transmuted association 107,as link 111, then may facilitate integration of dataset 115 a withdataset 105 a, thereby forming a merged dataset as an enriched dataset.When queried or modified subsequently, data enhancement manager 136 maybe configured to manage the enrichment (i.e., supplementation of dataset105 a). According to some examples, a transmuted association 207 mayrefer to, at least in some cases, a transmutation of an associationbetween or among primary key data and a foreign key data, in a tabulardata model, that may be applied or implemented within a graph datamodel.

In view of the foregoing, the structures and/or functionalities depictedin FIG. 1 illustrate dataset ingestion controller 120 being configuredto analyze, detect, and form transmuted associations between dataset 105a and one or more other datasets 115 a, and the data therein, duringingestion of a set of data 105 a to facilitate expeditious dataoperations, such as queries, that include the transmuted associations.According to some examples, a query may be applied via linked data(e.g., including link 111) of graph data arrangements 142 a and 142 b,thereby foregoing computing equality operations to detect whetherreferential indicator 113 a (e.g., value 116 a) matches referentialindicator 123 a (e.g., value 116 b). In some examples, an equivalencydetermination may be performed during ingestion of dataset 105 a, with atransmuted association obviating such determinations in relation to, forexample, queries or other data operations. Therefore, queries using oneor more links 111 based on transmuted associations may enhancecomputational performance by, among other things, foregoing computationsor calculations relating to the use of indices.

Further, since the structures and/or functionalities of collaborativedataset consolidation system 110 enable a query written against eitheragainst a tabular data arrangement or graph data arrangement to extractdata from a common set of data, a user (e.g., data scientist) thatfavors usage of either SQL-equivalent query languages orSPARQL-equivalent query languages, or any other equivalent programminglanguages, may implement any of the foregoing languages. As such, a datapractitioner may more easily query a common data set of data using afamiliar query language. To illustrate, consider a query may be directedto a tabular data arrangement to join dataset 105 a to a differentdataset 115 a to extract data from both datasets, whereby transmutedassociation 107 may be used to retrieve results of the query. As shown,a user 108 a may apply a relational query 192 on interface 194 ofcomputing device 108 b to query a graph data arrangement 196.

In one example, a command conforming to relational database operationsmay be used to query link 111 in a graph database. An example of such acommand may include a statement having a syntax associated withrelational data operations for accessing a relational data structure.Thus, a SQL-like language or command may be used to access via atransmuted association a graph database to obtain performanceenhancements by foregoing indexed-based associations, especially as thenumber of different links 111 may be integrated with an increasingnumber of dataset integrations.

Further to diagram 100, format converter 137 may be configured toconvert dataset 105 a into another format, such as a graph dataarrangement 142 a, which may be transmitted as data 101 c for storage indata repository 140. Graph data arrangement 142 a in diagram 100 may belinkable (e.g., via links 111) to other graph data arrangements to forma collaborative dataset. Also, format converter 137 may be configured togenerate ancillary data or descriptor data (e.g., metadata) thatdescribe attributes associated with each unit of data in dataset 105 a.The ancillary or descriptor data can include data elements describingattributes of a unit of data, such as, for example, a label orannotation (e.g., header name) for a column, an index or column number,a data type associated with the data in a column, etc. In some examples,a unit of data may refer to data disposed at a particular row and columnof a tabular arrangement (e.g., originating from a cell in dataset 105a). In some cases, ancillary or descriptor data may be used by dataclassifier 134 determine whether data may be classified into a certainclassification, such as where a column of data includes “zip codes.”

Layer data generator 136 may be configured to form linkage relationshipsof ancillary data or descriptor data to data in the form of “layers” or“layer data files.” Implementations of layer data files may facilitatethe use of supplemental data (e.g., derived or added data, etc.) thatcan be linked to an original source dataset, whereby original orsubsequent data may be preserved. As such, format converter 137 may beconfigured to form referential data (e.g., IRI data, etc.) to associatea datum (e.g., a unit of data) in a graph data arrangement to a portionof data in a tabular data arrangement. Thus, data operations, such as aquery, may be applied against a datum of the tabular data arrangement asthe datum in the graph data arrangement. An example of a layer datagenerator 136, as well as other components of collaborative datasetconsolidation system 110, may be described in U.S. patent applicationSer. No. 15/927,004 filed on Mar. 20, 2018, having Attorney Docket No.DAT-019 and titled “LAYERED DATA GENERATION AND DATA REMEDIATION TOFACILITATE FORMATION OF INTERRELATED DATA IN A SYSTEM OF NETWORKEDCOLLABORATIVE DATASETS,” which is herein incorporated by reference.

According to some embodiments, a collaborative data format may beconfigured to, but need not be required to, format converted dataset 105a as an atomized dataset. An atomized dataset may include a dataarrangement in which data is stored as an atomized data point that, forexample, may be an irreducible or simplest data representation (e.g., atriple is a smallest irreducible representation for a binaryrelationship between two data units) that are linkable to other atomizeddata points, according to some embodiments. As atomized data points maybe linked to each other, data arrangement 142 a may be represented as agraph, whereby converted dataset 105 a (i.e., atomized dataset 105 a)may form a portion of a graph. In some cases, an atomized datasetfacilitates merging of data irrespective of whether, for example,schemas or applications differ. Further, an atomized data point mayrepresent a triple or any portion thereof (e.g., any data unitrepresenting one of a subject, a predicate, or an object), according toat least some examples.

As further shown, collaborative dataset consolidation system 110 mayinclude a dataset attribute manager 161, which includes an attributecorrelator 163 and a data derivation calculator 165. Dataset ingestioncontroller 120 and dataset attribute manager 161 may be communicativelycoupled to dataset ingestion controller 120 to exchange dataset-relateddata 107 a and enrichment data 107 b, both of which may exchange datafrom a number of sources (e.g., external data sources) that may includedataset metadata 103 a (e.g., descriptor data or information specifyingdataset attributes), dataset data 103 b (e.g., some or all data storedin system repositories 140, which may store graph data), schema data 103c (e.g., sources, such as schema.org, that may provide various types andvocabularies), ontology data 103 d from any suitable ontology and anyother suitable types of data sources. One or more elements depicted indiagram 100 of FIG. 1 may include structures and/or functions assimilarly-named or similarly-numbered elements depicted in otherdrawings, or as otherwise described herein, in accordance with one ormore examples.

In this example, dataset ingestion controller 120 is shown tocommunicatively coupled to a user interface, such as data ingestioninterface 102 via one or both of a user interface (“UI”) elementgenerator 180 and a programmatic interface 190 to exchange data and/orcommands (e.g., executable instructions) for facilitating dataenrichment of dataset 105 a. UI element generator 180 may be configuredto generate data representing UI elements to facilitate the generationof data ingestion interface 102 and graphical elements thereon. Forexample, UI generator 180 may cause generation UI elements, such as acontainer window (e.g., icon to invoke storage, such as a file), abrowser window, a child window (e.g., a pop-up window), a menu bar(e.g., a pull-down menu), a context menu (e.g., responsive to hovering acursor over a UI location), graphical control elements (e.g., user inputbuttons, check boxes, radio buttons, sliders, etc.), and othercontrol-related user input or output UI elements. Programmatic interface190 may include logic configured to interface collaborative datasetconsolidation system 110 and any computing device configured to presentdata ingestion interface 102 via, for example, any network, such as theInternet. In one example, programmatic interface 190 may be implementedto include an applications programming interface (“API”) (e.g., a RESTAPI, etc.) configured to use, for example, HTTP protocols (or any otherprotocols) to facilitate electronic communication. According to someexamples, user interface (“UI”) element generator 180 and a programmaticinterface 190 may be implemented in collaborative dataset consolidationsystem 110, in a computing device associated with data ingestioninterface 102, or a combination thereof. UI element generator 180 and/orprogrammatic interface 190 may be referred to as computerized tools, ormay facilitate employing a user interface as a computerized tool,according to some examples.

In at least one example, additional datasets to enhance dataset 142 amay be determined through collaborative activity, such as identifyingthat a particular dataset may be relevant to dataset 142 a based onelectronic social interactions among datasets and users. For example,data representations of other relevant dataset to which links may beformed may be made available via a dataset activity feed. A datasetactivity feed may include data representing a number of queriesassociated with a dataset, a number of dataset versions, identities ofusers (or associated user identifiers) who have analyzed a dataset, anumber of user comments related to a dataset, the types of comments,etc.). Thus, dataset 142 a may be enhanced via “a network for datasets”(e.g., a “social” network of datasets and dataset interactions). While“a network for datasets” need not be based on electronic socialinteractions among users, various examples provide for inclusion ofusers and user interactions (e.g., social network of data practitioners,etc.) to supplement the “network of datasets.” According to variousembodiments, one or more structural and/or functional elements describedin FIG. 1, as well as below, may be implemented in hardware or software,or both. Examples of one or more structural and/or functional elementsdescribed herein may be implemented as set forth in one or more of U.S.patent application Ser. No. 15/186,514, filed on Jun. 19, 2016, havingAttorney Docket No. DAT-001 and titled “COLLABORATIVE DATASETCONSOLIDATION VIA DISTRIBUTED COMPUTER NETWORKS,” U.S. patentapplication Ser. No. 15/186,517, filed on Jun. 19, 2016, having AttorneyDocket No. DAT-004 and titled “QUERY GENERATION FOR COLLABORATIVEDATASETS,” and U.S. patent application Ser. No. 15/454,923, filed onMar. 9, 2017, having Attorney Docket No. DAT-009 and titled“COMPUTERIZED TOOLS TO DISCOVER, FORM, AND ANALYZE DATASETINTERRELATIONS AMONG A SYSTEM OF NETWORKED COLLABORATIVE DATASETS,” eachof which is herein incorporated by reference.

FIG. 2 is a diagram depicting an example of an atomized data point,according to some embodiments. Diagram 250 depicts a portion 251 of anatomized dataset that includes an atomized data point 254. In thisexample, atomized data point 254 and/or its constituent components mayfacilitate implementation of a transmuted association within a graphdata arrangement based on a graph data model. As shown, transmutedassociated 270 may be implemented to form a link between a unit of data243, which may represent a city name, and a unit of data 244, which mayrepresent a magnitude (“MAG”) of a tornado. Unit of data 243 may beassociated with a column of data 241, which may serve as a primary keyin a tabular data structure 230, whereas unit of data 244 may beassociated with a column of data 242, which may serve as a foreign keyin a tabular data structure 232.

In some examples, an atomized dataset may be formed by converting atabular data format into a format associated with the atomized dataset.In some cases, portion 251 of the atomized dataset can describe aportion of a graph that includes one or more subsets of linked data.Further to diagram 250, one example of atomized data point 254 is shownas a data representation 254 a, which may be represented by datarepresenting two data units 252 a and 252 b (e.g., objects) that may beassociated via data representing an association 256 with each other. Oneor more elements of data representation 254 a may be configured to beindividually and uniquely identifiable (e.g., addressable), eitherlocally or globally in a namespace of any size. For example, elements ofdata representation 254 a may be identified by identifier data 290 a,290 b, and 290 c (e.g., URIs, URLs, IRIs, etc.).

In some embodiments, atomized data point 254 a may be associated withancillary data 153 to implement one or more ancillary data functions.For example, consider that association 256 spans over a boundary betweenan internal dataset, which may include data unit 252 a, and an externaldataset (e.g., external to a collaboration dataset consolidation), whichmay include data unit 252 b. Ancillary data 253 may interrelate viarelationship 280 with one or more elements of atomized data point 254 asuch that when data operations regarding atomized data point 254 a areimplemented, ancillary data 253 may be contemporaneously (orsubstantially contemporaneously) accessed to influence or control a dataoperation. In one example, a data operation may be a query and ancillarydata 253 may include data representing authorization (e.g., credentialdata) to access atomized data point 254 a at a query-level dataoperation (e.g., at a query proxy during a query). Thus, atomized datapoint 254 a can be accessed if credential data related to ancillary data253 is valid (otherwise, a request to access atomized data point 254 a(e.g., for forming linked datasets, performing analysis, a query, or thelike) without authorization data may be rejected or invalidated).According to some embodiments, credential data (e.g., passcode data),which may or may not be encrypted, may be integrated into or otherwiseembedded in one or more of identifier data 290 a, 290 b, and 290 c.Ancillary data 253 may be disposed in other data portion of atomizeddata point 254 a, or may be linked (e.g., via a pointer) to a data vaultthat may contain data representing access permissions or credentials.

Atomized data point 254 a may be implemented in accordance with (or becompatible with) a Resource Description Framework (“RDF”) data model andspecification, according to some embodiments. An example of an RDF datamodel and specification is maintained by the World Wide Web Consortium(“W3C”), which is an international standards community of Memberorganizations. In some examples, atomized data point 254 a may beexpressed in accordance with Turtle (e.g., Terse RDF Triple Language),RDF/XML, N-Triples, N3, or other like RDF-related formats. As such, dataunit 252 a, association 256, and data unit 252 b may be referred to as a“subject,” “predicate,” and “object,” respectively, in a “triple” datapoint (e.g., as linked data). In some examples, one or more ofidentifier data 290 a, 290 b, and 290 c may be implemented as, forexample, a Uniform Resource Identifier (“URI”), the specification ofwhich is maintained by the Internet Engineering Task Force (“IETF”).According to some examples, credential information (e.g., ancillary data253) may be embedded in a link or a URI (or in a URL) or anInternationalized Resource Identifier (“TM”) for purposes of authorizingdata access and other data processes. Therefore, an atomized data point254 may be equivalent to a triple data point of the Resource DescriptionFramework (“RDF”) data model and specification, according to someexamples. Note that the term “atomized” may be used to describe a datapoint or a dataset composed of data points represented by a relativelysmall unit of data. As such, an “atomized” data point is not intended tobe limited to a “triple” or to be compliant with RDF; further, an“atomized” dataset is not intended to be limited to RDF-based datasetsor their variants. Also, an “atomized” data store is not intended to belimited to a “triplestore,” but these terms are intended to be broaderto encompass other equivalent data representations.

Examples of triplestores suitable to store “triples” and atomizeddatasets (and portions thereof) include, but are not limited to, anytriplestore type architected to function as (or similar to) a BLAZEGRAPHtriplestore, which is developed by Systap, LLC of Washington, D.C.,U.S.A.), any triplestore type architected to function as (or similar to)a STARDOG triplestore, which is developed by Complexible, Inc. ofWashington, D.C., U.S.A.), any triplestore type architected to functionas (or similar to) a FUSEKI triplestore, which may be maintained by TheApache Software Foundation of Forest Hill, Md., U.S.A.), and the like.

FIG. 3 is a diagram depicting an example of formatting a dataset to forma transmuted association, according to some examples. Diagram 300depicts a dataset 310 including subsets of data, including a column ofdata values representing “zip codes,” disposed in a tabular dataarrangement. Format converter 337 may be configured to convert dataset310 into another format, such as a graph data arrangement. In this case,rows, including row 313 a, of dataset 310 may be associated or otherwiselinked to row nodes 321 of a graph (not shown). In some implementations,nodes 321 may also reference data representing entities, records, andthe like. Also shown, columns, such as column 315 a, of dataset 310 maybe associated with column nodes 302 of a graph (not shown). Other nodes,links, references, etc. of a graph may be implemented (not shown). Asshown, a unit of data 311 includes a string or an integer representing azip code “83631.”

Dataset ingestion controller 320 may be configured to analyze data ofdataset 310 against data in a pool of one or more dataset, any of whichmay be linked to another dataset. An example of one or more datasets isdepicted as dataset 370, which may be disposed in a graphical dataarrangement. Dataset 370 may be associated with a graph including rownodes 350 and columns nodes 357, as well as other nodes, links,references, etc. (not shown). Here, links from a graph (e.g., via nodes350 and 357) to units of data may be usable to present dataset 370 in atabular data arrangement including rows, such as row 313 b, and columns,such as columns 315 b, 315 c, and 315 d.

Dataset ingestion controller 320 may be configured to match data indataset 310 against data in a pool of data including dataset(s) 370. Inthe example shown, a value of a unit of data 311 (of dataset 310) maymatch a value of a unit of data 323 (of dataset 370). Dataset ingestioncontroller 320 also may be configured to detect data in column 315 a asincluding an equivalent data classification as column 315 b. Inparticular, columns 315 a and 315 b include “zip code” data. Hence, datain column 315 a may be identified as a first reference indicator anddata in column 315 b may be identified as a second reference indicator.Thus, a unit of data (e.g., data unit 311) may reference 340 to anotherunit of data (e.g., data unit 323).

In some examples, data in column 315 a may be used to establish aprimary key, and data in column 315 b may be used to establish a foreignkey (or conversely). Therefore, a user may be presented in a userinterface an indication that columns 315 a and 315 b may include zipcode data, whereby a user may confirm the columns include equivalentdata so that associations, such as association 340, may be used tocombine (e.g., join) data of datasets 310 and 370 at columns includingreference indicator data. Association 340 may identify that a unit ofdata (“zip code 83631”) 311 in row 313 a is linked to another unit ofdata (“zip code 83631”) 323 in row 313 b.

According to some examples, one or more of dataset ingestion controller320, format converter 337, and layer data generator 338 may beconfigured to transmute association 340 into a graph data arrangement,whereby a transmuted association 362 may be formed within a graph dataarrangement. In the example shown, transmuted association 362 may link anode associated with unit of data 311 and a node associated with a unitof data 323. In the example shown, units of data 311 and 323 may beassociated with a layer (“X”) 330, whereby layer data generator 338identifies links for row node 321 a and column node 302 a for unit ofdata 311, and identifies links for row node 350 a and column node 357 afor unit of data 323. Layer 330 may also include data representing alink to transmuted association 362.

A graph portion 380 is shown to include one or more links based on atransmuted association derived from a relationship between, for example,primary and secondary keys may be implemented as a portion of a graph.In graph portion 380, a node 390 a associated with a unit of data (e.g.,zip code 83631) links to a node 392 a, which is associated with a countyname (e.g., county name “Adams County”). Nodes 390 a and 392 a may belinked via link 391 a, which represents that zip code 83631 “is a partof” Adams County. Further, node 392 a may link to a node 392 b, which isassociated with a state name (e.g., state name “Idaho”). Nodes 392 a and392 b may be linked via link 391 c, which represents that county nameAdams County “is a part of” state name Idaho. Links 391 a and 391 c maybe form one or more portions of a transmuted association 362 in whichrows 313 a and 313 b may be combined to associate unit of data (“83631”)of row 313 a to unit of data (“Adams”) 324 and unit of data (“Idaho”)325, both of which reside in row 313 b.

According to at least on example, an auxiliary query generator describedin FIGS. 6 to 7 may be configured to generate an additional link in agraph data arrangement, whereby an additional link may be formed as a“created triple.” Specifically, an auxiliary query may be applied tonodes 390 a, 392 a, and 392 b and links 391 a and 391 c to identify animplicit relationship (i.e., zip code 83631 “is part of” the state ofIdaho), thereby forming a triple including node 390 a, link 391 b, andnode 392 b, which may be referred to as an explicit relationship.

In view of the foregoing, a relational query, or a variant thereof(e.g., an SQL-equivalent query), may be applied to data in a combinationof datasets 310 and 370, which may be presented via a user interface(not shown) as a table of rows and columns. A dataset query engine, asshown in FIG. 4, may be implemented to receive the relational query andapply a query 382 to graph portion 380, thereby foregoing computingcomparing data values to detect equalities of indexes used on tabulardata arrangements. One or more elements depicted in diagram 300 of FIG.3 may include structures and/or functions as similarly-named orsimilarly-numbered elements depicted in other drawings, or as otherwisedescribed herein, in accordance with one or more examples.

FIG. 4 is a diagram depicting a dataset query engine configured toimplement a query via a transmuted association against a graph dataarrangement, according to some examples. Diagram 400 includes a datasetquery engine 439, which may be disposed in a collaborative datasetconsolidation system (not shown). Dataset query engine 439 may beconfigured to receive a query 402 to apply against a combined dataset420, which is depicted as a combination of tabular data arrangements. Insome examples, query 402 may be implemented as either a relational-basedquery (e.g., in an SQL-equivalent query language) or a graph-based query(e.g., in a SPARQL-equivalent query language). One or more elementsdepicted in diagram 400 of FIG. 4 may include structures and/orfunctions as similarly-named or similarly-numbered elements depicted inother drawings, or as otherwise described herein, in accordance with oneor more examples.

Combined dataset 420 may be presented in a user interface as a tablebased on tabular data arrangements in which data in an ingested dataset105 a and another dataset 115 a may be combined. Dataset 105 a is shownto include a unit of data 116 a associated with a subset of referenceindicators (e.g., data of column 113 a), whereas dataset 115 a mayinclude a unit of data 116 b associated with another subset of referenceindicators (e.g., data of column 123 a). As shown, value 116 a in a rowof dataset 105 a may, as a referential indicator, be used to referencevia 106 to value 116 b. Also shown is an association 107 betweenreferential indicator 123 a and referential indicator 123 b, and, thus,between value 116 a and another value 116 b.

Data representing association 107 between value 116 a and another value116 may be transmuted to form a transmuted association depicted as atransmuted link 111 to combine dataset 105 a disposed in a graph, suchas ingested dataset 440 a, with another dataset 115 a disposed inanother graph, such as other datasets 440 b. Transmuted link 111 thusfacilitates querying a merged dataset 440 as a graph data arrangementvia transmuted link 111, which couples node 199 a to 199 b. In oneexample, node 199 a may be associated with value 116 a and node 199 bmay be associated with other value 116 b, whereby transmuted link 111may include data characterizing a relationship or property associatingvalues 116 a and 116 b. In this example, transmuted link 111 includesdata characterizing values associated with nodes 199 a and 199 b asbeing equivalent (e.g., equal or sufficiently similar to each other).According to various examples, data may vary for transmuted link 111 andnodes 199 a and 199 b to form any number of triples. In view of theforegoing, a query 402 configured to query a relational data model maybe received into dataset query engine 439, which, in turn, transmits aquery 406 for application against graph data arrangements as a mergeddataset 440. Query 406 omits or otherwise need not invoke applicationof, or computations for, an index-based association to query linked dataof a graph. A query being applied to node 199 a may be extended toinclude node 199 c.

FIG. 5 is a flow diagram depicting an example of transmutingrelationships among data during data ingestion to enhance querying andretrieving results thereof, according to some embodiments. At 502 offlow 550, data representing a dataset may be received into a datasetingestion controller. At 504, data representing the dataset may beidentified as being disposed in, or may be arranged within, a first dataarrangement having a first format, such as a tabular format. At 506, afirst referential indicator for a first set of the dataset in the firstdata arrangement may be identified. The first referential indicator mayrefer to one or more data values disposed, for example, in a column, ormay refer to one or more columns of data. At 508, an association may bedetermined, whereby the association may exist between a valuerepresentative of the first referential indicator and an equivalentvalue representative of a second referential indicator associated with asecond set of a different dataset. At 510, an ingested dataset may beformatted into a second data arrangement having a second format, such asa graph format. Note that 510 may be disposed anywhere in flow 500, suchas subsequent to 506. At 512, an association may be transmuted to form atransmuted association, as a link between a value and an equivalentvalue. At 514, a transmuted association may be integrated into at leasta portion of the first data arrangement. Further, transmuted associationmay be integrated into a combined dataset (e.g., a merged dataset), andmay persist for subsequent dataset links and data enhancements.

FIG. 6 is a diagram depicting examples of one or more auxiliary querygenerators for enriching ingested datasets, according to some examples.Diagram 600 includes a dataset ingestion controller 620, which includesa dataset analyzer 630. Further, dataset ingestion controller 620includes a data enhancement manager 636 including one or more auxiliaryquery generators, such as auxiliary query generators 638 a, 638 b, 638c, and 638 n. Data enhancement manager 636 may be communicativelycoupled to a data repository 640 storing any number of datasets in apool of datasets, including dataset 642, within a graph dataarrangement. Also, data enhancement manager 636 may be coupled to acomputing device (not shown) to present a data enhancement interface603, which may accept user input to initiate generation of auxiliaryqueries as “link-formative” queries. A link-formative query may beconfigured to generate results for integrating or merging back into aningested dataset 605 a, thereby enhancing ingested data set 605 a. Alink-formative query may be a query that, for example, invokes orotherwise is configured to form links, at least in some implementations.Thus, results of a link-formative query may be a graph including acreated or new dataset of linked data. One or more elements depicted indiagram 600 of FIG. 6 may include structures and/or functions assimilarly-named or similarly-numbered elements depicted in otherdrawings, or as otherwise described herein, in accordance with one ormore examples.

In the example shown, data representing a dataset 605 a may be receivedinto a dataset ingestion controller (not shown). Dataset ingestioncontroller 620 and/or its constituent components may identify dataset605 a is, or may otherwise arranged, in a first data arrangement (e.g.,a tabular data arrangement) in a first format (e.g., a table). Datasetingestion controller 620 may transform a tabular data arrangement inwhich dataset 605 a is disposed into dataset 644, which is a second dataarrangement (e.g., a graph data arrangement) in a second format (e.g., agraph) in which data in dataset 605 a is disposed. Dataset analyzer 630may be configured to analyze data representing dataset 605 a to detectsubsets of data values for which to perform a query (e.g., as alink-formative query). An example of a subset of data values includesdata values in, for example, a column 613 a for analyzing and detectingwhether to perform a link-formative query.

An auxiliary query generator, such as one of auxiliary query generators638 a, 638 b, 638 c, and 638 n, may be configured to identify a subsetof data, such as one or more data values in column 613 a that may becompared against a pool of datasets to identify equivalent data valuesor dataset attributes with which to form links (e.g., as at least aportion of a link-formative query) among data in the subset of data incolumn 613 a and the pool of datasets. A pool of datasets 642 mayinclude any number of linked data-based graph data arrangements, atleast some of which may be stored in repository 640. In some examples,an auxiliary query generator may identify equivalent data values (ordataset attributes) in dataset 605 a and pool of datasets 642 upon whichto perform a link-formative query. A link-formative query may beconfigured to perform an auxiliary or subsidiary query on ingesteddatasets 605 a for identifying linkable datasets in pool of datasets642, generating another subset of data to form a created subset oflinkable data (e.g., data that can form linked data), and integrating ormerging the created subset of data back into, for example, dataset 605 aas an enrichment to dataset 644, according to some examples. In somecases, a created subset includes new data values that are absent iningested dataset 605 a and may be introduced into a new or added columnof a tabular data arrangement for ingested dataset 605 a. Further, datavalues of column 613 a, such as “zip code data values,” may be linked toa created subset of data, as linked data, which can be presentedgraphically as “linked data” in a user interface, examples of which aredepicted in FIGS. 8A and 8B.

A link-formative query may be initiated, for example, by an auxiliaryquery generator, to search for specific subsets of data in pool of data642 that may be associated with specific subsets of data in columns of605 a. A search may be based on a specific subset or column of dataincludes data classified to include similar data types, dataclassifications (e.g., zip code data), etc. According to some examples,each of auxiliary query generators 638 a, 638 b, 638 c, and 638 n mayuse specific subsets of data to search (e.g., query) a pool of datasets642. Consider the following example in which auxiliary query generator638 a may be configured to identify or use “zip code data” disposed incolumn 613 a to search for other data associated with zip code data inpool of datasets 642 from which to from a new, created dataset.Auxiliary query generator 638 a may be configured to identify or use“infectious disease data” (e.g., flu outbreak data, such as data valuesrepresenting different flu types, such as A, A2, B, C, H5, H5N1, etc.)disposed in column 613 a to search for other data associated withhealth-related data in pool of datasets 642 from which to form anothernew, created dataset. Other auxiliary query generators may implement anysubset of data values in columns 613 a to perform link-formative queries“in-situ” or “in-line” (e.g., in real time or near real time) to enhanceexpansion of data in atomized dataset generation during the datasetingestion and/or graph formation processes, which may be prior tosubsequent data operations, such as queries. According to some examples,a link-formative query may be based on a transmuted association. Otherauxiliary query generators may implement any subset of data values incolumns 613 a to perform link-formative queries “in-situ” or “in-line”(e.g., in real time or near real time) to enhance expansion of data inatomized dataset generation during the dataset ingestion and/or graphformation processes. According to some examples, a link-formative querymay be based on a transmuted association.

In alternative examples, at least one of auxiliary query generators 638a, 638 b, 638 c, and 638 n may identify or use a subset of data valuesdisposed in column 613 a to compute or modify the subset of data valuesto form a created subset of data. For example, auxiliary query generator638 c may be configured to initiate a query to identify whether to use“data-related” data (e.g., day, month, year, time, etc.) disposed incolumn 613 a for modification to, for example, modify an annotation orform of date-related information (e.g., removing day and month topresent year only dates). Thus, modified date-related data may bedisposed in a new, created column that may be implemented, such ascolumn 613 a, within dataset 605 a. As another example, auxiliary querygenerator 638 n may be configured to identify or use numeric data valuesdisposed in column 613 a for use in machine learning computations. Assuch, auxiliary query generator 638 n may initiate a query to identifywhether to initiate a computation or modification to “normalize” thenumeric data values into, for example, a range from zero (“0”) to one(“1”). In some cases, a response to the query may originate from datasetenrichment interface 603. Other auxiliary query generators may implementany other computations or modifications to any subset of data values incolumns 613 a to perform link-formative queries or modifications“in-situ” or “in-line.”

In some examples, operation of data enhancement manager 636 and/or itsconstituent components, such as auxiliary query generators 638 a, 638 b,638 c, and 638 n, may be guided or supplemented by performance ofexecutable instructions based on commands received responsive to inputsvia dataset enrichment interface 603. In one implementation, datasetanalyzer 630 may detect that column 613 a includes “zip code” data, and,in response, dataset enrichment interface 603 may present via interfaceportion 606 selections with which to generate commands based on whethercolumn 613 a includes zip code data (e.g., via selection of input 671),or do not include zip code data (e.g., via selection of input 673).Further, dataset enrichment interface 603 may be configured to presentan interface portion 607 to provide selections from which a user inputdata may be generated to perform one or more auxiliary queries. So, ifselection 671 is activated, interface portion 607 may provide aselection 608 a to include population data (e.g., related to zip codedata), a selection 608 b to include congressional data (e.g., related tozip code data), a selection 608 c to include crime data (e.g., relatedto zip code data), and a selection 608 d to include data directed to amodify a date format (e.g., year only date information). Each ofselections 608 a, 608 b, 608 c, and 608 d may initiate a link-formativequery (e.g., an auxiliary query), the results of which may be formattedfor inclusion as columnar data, such as in column 613 a of dataset 605a. The results of each of the link-formative queries may be integratedback into in either dataset 605 a in a tabular data arrangement or indataset 644 graph data arrangement, which includes data of dataset 605 adisposed in a graph. Thus, either the link-formative queries or resultstherefrom, or both, may be stored in repository 640 for subsequent use.

Operation of data enhancement manager 636 and/or its constituentcomponents, such as auxiliary query generators 638 a, 638 b, 638 c, and638 n, may be automatic (e.g., without user input) in some examples.Further, merged datasets and results of link-formative queries maypersist so that an integrated dataset, such as merge datasets 644 a, maybe modified or supplemented (e.g., via data ingestion) subsequent toinitial formation. Thus, operation of auxiliary query generators 638 a,638 b, 638 c, and 638 n may be automatically activated repeatedly until,for example, a user removes or deletes a subset of data from mergeddataset 644 a. As shown, merged dataset (e.g., an enhanced dataset)includes a graph 640 a of ingested data associated with datasets 605 aand a graph 640 b of a pool of datasets. A transmuted link 611 may linkgraph 640 a to graph 640 b, whereby graphs 640 a and 640 b may includeatomized datasets.

Moreover, results of an auxiliary query (e.g., a link-formative query)may be implemented as link 391 b, responsive to a link-formative querythat identifies “state name” data 392 b based on a column of “zip code”data 390 a in accordance with FIG. 3. Therefore, a link-formative querymay be configured to form an explicit or direct link 391 b based onimplicit or indirect links 391 a and 391 c via node 392 a, which may beassociated with “county name” data. In at least one example, formationof link 391 b (e.g., based on a link-formative query) provides for acreated dataset that includes at least one additional triple.

FIG. 7 is a flow diagram depicting an example of implementinglink-formative queries to enhance datasets, according to someembodiments. At 702, data representing a dataset may be received, forexample, into dataset ingestion controller. At 704, a first dataarrangement in a first format may be identified in which the datarepresenting the dataset is arranged. At 706, a first data arrangementin the first format may be transformed into a second data arrangement ina second format, which may be graph-related. In some examples, a firstdata arrangement may be transformed into an atomized dataset thatincludes triples.

At 708, data representing the dataset may be analyzed to detect subsetsof data values for which to query against in a link formative query. Forexample, an association may be determined, whereby the association maybe between a value representative of a first referential indicator andan equivalent value representative of a second referential indicator,which may be associated with a different dataset. The different datasetmay be a table or graph, or may be externally disposed. In someexamples, one of the first referential indicator and the secondreferential indicator may be a primary key. The other of the firstreferential indicator and the second referential indicator may be aforeign key. In some examples, an association between referentialindicators may be transmuted to form a transmuted association betweenthe value and the equivalent value. In some examples, a transmutedassociation includes an association between referential indicators thatis converted, formatted, or mapped into a graph data arrangement,according to at least one example to facilitate queries that, forexample, need not implement indices to compute equivalent data. In someexamples, a transmuted association facilitates link-formative queries tocreate datasets with, for example, explicit and direct links.

At 710, one or more link-formative queries may be applied to dataset ina second data arrangement. As such, link-formative queries may beapplied to graph data arrangements, which may include a pattern oftriples. At 712, results of the one or more link-formative queries maybe identified. In some examples, results may be determined as a subsetof resultant triples associated with a pattern of triples. A result ofat least one link-formative query may be referred to as an auxiliarygraph data arrangement, according to some examples. As a graph,auxiliary graph data arrangement may be integrated to form a mergedgraph. In at least one example, a link-formative query may apply agraph-based statement or command to identify patterns of linked data,such as triples, matching data defining a desired result, whereby thedesired result “constructs” a created graph-based dataset. A graph-basedstatement or command may include a CONSTRUCT clause based on, forexample, a graph querying language (e.g., SPARQL, or the like), theCONSTRUCT clause being configured to form created graphs matching aquery pattern, which may be set forth, for example, in a WHERE clause.Other graph-based statements or commands that create graphs (e.g., newtriples) may be used, and are not limited to SPARQL-based statement orcommands. At 712, an enhanced dataset may be formed, whereby theenhanced dataset may include results of one or more link-formativequeries in the dataset.

FIGS. 8A to 8D are diagrams depicting computerized tools of a userinterface to cause formation of transmuted associations to facilitatelink-formative queries, according to some examples. Diagram 800 of FIG.8A depicts as file (e.g., .CSV) including data representing a dataset,which may be identified or arranged into a tabular data arrangement 804.According to some examples, interface portion 806 includes selections871 and 873 to receive user input as to whether a column, such as column810, includes a zip code data. In this case, selection 871 is selectedand, in response, executable instructions are activated to link numericzip codes “78703” and “78731” of column 810 to other data in, forexample, a graph data arrangement. In at least one example, linking ofzip codes “78703” and “78731” to “other datasets” may be facilitated byway of implementing a transmuted association. As shown, graphicalidentifiers 812 encircling each zip code number indicates thatcorresponding zip codes “78703” and “78731” may link to form an enricheddataset (e.g., as a merged dataset). For example, column 810 may link todata 821 representing, for example, “population density” per zip code,as depicted in a choropleth of zip codes in interface portion 820. Asanother example, a selection device, such as cursor 814, may causepresentation of interface portion 822, which includes enhanced data notwithin file 802, and made available by implementing a transmutedassociation (not shown) in a graph. In the example shown, zip codenumber 78731 and column 810 may link to enhanced datasets 824 and 826.Dataset 824 includes hypertext links to congressional data, climatedata, crime data, demographic data, and hotel data, all of which areassociated with zip code 78731.

FIG. 8B is a diagram 830 depicting interface processes of computerizedtools to form enhanced dataset, according to some examples. Whiledataset 832 may be presented in diagram 830 in a tabular dataarrangement, units of data therein may be linked to an underlying mergedgraph as graph data arrangement. To enhance dataset 832, a command maybe activated to present interface portion 834, which presents options toenhance dataset 832. Selection 836, if selected, may cause presentationsof user inputs in a user interface to enhance dataset 832 a by addingeither city data in column 837 or state data in column 839. Responsiveto one or more selections 831 a and 831 b, dataset 832 a may beintegrated with data in columns 837 and/or 839, thereby forming a mergeddataset, at least in the example shown. In some examples, a dataarrangement 832 may be transformed into an atomized dataset includingsubsets of linked data points (e.g., in a graph). The data representingdataset 832 may be analyzed to detect zip code data values 78703 and7873 a, with which to query against in a link-formative query. Alink-formative query applied to a pool of datasets, based on the zipcode data values, may identify linkable data points in a pool ofdatasets that include, for example, “city name” data and “state name”data.

FIG. 8C is a diagram 850 depicting another example of interfaceprocesses of computerized tools to form an enhanced dataset, at least insome examples. To enhance dataset 832, a command may be activated topresent interface portion 854, which presents options to aggregate datavia computations or data modification applied to dataset 852. Selection856, if selected, may cause presentations to enhance dataset 852 a byadding data in a column representing “mean age” data 860 linked to zipcodes 78703 and 78731, responsive to selections related to interfaceportions 857, 858, and 859. Thus, mean age data 860 may be derived viacalculations applied to linked datasets that includes age-related datarelated to zip codes. Selection 864, if activated, may cause formationof an enhanced dataset based on 852 that includes mean age data 860.

In some examples, data representing 852 dataset may be analyzed todetect zip code data values with which to query against a pool ofdatasets based on a link-formative query. A link-formative query may beapplied to a pool of datasets (e.g., other atomized datasets) based onzip code data values to detect other data points associated with zipcodes. A data value to form a computed data value of “mean age” data 860associated with another data point may be calculated. The computedresult includes a column of “mean age” data 860 that may includeadditional linkable data points in a pool of atomized datasets tofurther enhance formation of a merged dataset. The linkable data pointsmay be linked to dataset 852 a responsive to activation of input 864.

FIG. 8D is a diagram 870 depicting yet another example of interfaceprocesses of computerized tools to form an enhanced dataset, at least insome examples. To enhance dataset 872, a command may be activated topresent interface portion 874, which presents options to aggregate datavia computations or data modification applied to dataset 872. Selection876, if selected, may cause presentations of user input selections toenhance dataset 872, which may include columns 873 and 880, by addingdata in a column representing “ACS mean age” data 882 linked to zipcodes 78703 and 78731, responsive to selections related to interfaceportions 877, 878, and 879. “ACS mean age” data may refer to AmericanCommunity Survey (“ACS”) data provided in U.S. Census data, as oneexample. Thus, ACS mean age data 882 may be derived via modificationsapplied to linked datasets that includes age-related data related to zipcodes. Selection 884, if activated, may cause formation of an enhanceddataset based on 872 that includes ACS mean age data 884.

FIG. 9 illustrates examples of various computing platforms configured toprovide various functionalities to any of one or more components of acollaborative dataset consolidation system, according to variousembodiments. In some examples, computing platform 900 may be used toimplement computer programs, applications, methods, processes,algorithms, or other software, as well as any hardware implementationthereof, to perform the above-described techniques.

In some cases, computing platform 900 or any portion (e.g., anystructural or functional portion) can be disposed in any device, such asa computing device 990 a, mobile computing device 990 b, and/or aprocessing circuit in association with initiating the formation ofcollaborative datasets, as well as analyzing forming enhance datasetsusing transmuted associations, via user interfaces and user interfaceelements, according to various examples described herein.

Computing platform 900 includes a bus 902 or other communicationmechanism for communicating information, which interconnects subsystemsand devices, such as processor 904, system memory 906 (e.g., RAM, etc.),storage device 908 (e.g., ROM, etc.), an in-memory cache (which may beimplemented in RAM 906 or other portions of computing platform 900), acommunication interface 913 (e.g., an Ethernet or wireless controller, aBluetooth controller, NFC logic, etc.) to facilitate communications viaa port on communication link 921 to communicate, for example, with acomputing device, including mobile computing and/or communicationdevices with processors, including database devices (e.g., storagedevices configured to store atomized datasets, including, but notlimited to triplestores, etc.). Processor 904 can be implemented as oneor more graphics processing units (“GPUs”), as one or more centralprocessing units (“CPUs”), such as those manufactured by Intel®Corporation, or as one or more virtual processors, as well as anycombination of CPUs and virtual processors. Computing platform 900exchanges data representing inputs and outputs via input-and-outputdevices 901, including, but not limited to, keyboards, mice, audioinputs (e.g., speech-to-text driven devices), user interfaces, displays,monitors, cursors, touch-sensitive displays, LCD or LED displays, andother I/O-related devices.

Note that in some examples, input-and-output devices 901 may beimplemented as, or otherwise substituted with, a user interface in acomputing device associated with a user account identifier in accordancewith the various examples described herein.

According to some examples, computing platform 900 performs specificoperations by processor 904 executing one or more sequences of one ormore instructions stored in system memory 906, and computing platform900 can be implemented in a client-server arrangement, peer-to-peerarrangement, or as any mobile computing device, including smart phonesand the like. Such instructions or data may be read into system memory906 from another computer readable medium, such as storage device 908.In some examples, hard-wired circuitry may be used in place of or incombination with software instructions for implementation. Instructionsmay be embedded in software or firmware. The term “computer readablemedium” refers to any tangible medium that participates in providinginstructions to processor 904 for execution. Such a medium may take manyforms, including but not limited to, non-volatile media and volatilemedia. Non-volatile media includes, for example, optical or magneticdisks and the like. Volatile media includes dynamic memory, such assystem memory 906.

Known forms of computer readable media includes, for example, floppydisk, flexible disk, hard disk, magnetic tape, any other magneticmedium, CD-ROM, any other optical medium, punch cards, paper tape, anyother physical medium with patterns of holes, RAM, PROM, EPROM,FLASH-EPROM, any other memory chip or cartridge, or any other mediumfrom which a computer can access data. Instructions may further betransmitted or received using a transmission medium. The term“transmission medium” may include any tangible or intangible medium thatis capable of storing, encoding or carrying instructions for executionby the machine, and includes digital or analog communications signals orother intangible medium to facilitate communication of suchinstructions. Transmission media includes coaxial cables, copper wire,and fiber optics, including wires that comprise bus 902 for transmittinga computer data signal.

In some examples, execution of the sequences of instructions may beperformed by computing platform 900. According to some examples,computing platform 900 can be coupled by communication link 921 (e.g., awired network, such as LAN, PSTN, or any wireless network, includingWiFi of various standards and protocols, Bluetooth®, NFC, Zig-Bee, etc.)to any other processor to perform the sequence of instructions incoordination with (or asynchronous to) one another. Computing platform900 may transmit and receive messages, data, and instructions, includingprogram code (e.g., application code) through communication link 921 andcommunication interface 913. Received program code may be executed byprocessor 904 as it is received, and/or stored in memory 906 or othernon-volatile storage for later execution.

In the example shown, system memory 906 can include various modules thatinclude executable instructions to implement functionalities describedherein. System memory 906 may include an operating system (“O/S”) 932,as well as an application 936 and/or logic module(s) 959. In the exampleshown in FIG. 9, system memory 906 may include any number of modules959, any of which, or one or more portions of which, can be configuredto facilitate any one or more components of a computing system (e.g., aclient computing system, a server computing system, etc.) byimplementing one or more functions described herein.

The structures and/or functions of any of the above-described featurescan be implemented in software, hardware, firmware, circuitry, or acombination thereof. Note that the structures and constituent elementsabove, as well as their functionality, may be aggregated with one ormore other structures or elements. Alternatively, the elements and theirfunctionality may be subdivided into constituent sub-elements, if any.As software, the above-described techniques may be implemented usingvarious types of programming or formatting languages, frameworks,syntax, applications, protocols, objects, or techniques. As hardwareand/or firmware, the above-described techniques may be implemented usingvarious types of programming or integrated circuit design languages,including hardware description languages, such as any register transferlanguage (“RTL”) configured to design field-programmable gate arrays(“FPGAs”), application-specific integrated circuits (“ASICs”), or anyother type of integrated circuit. According to some embodiments, theterm “module” can refer, for example, to an algorithm or a portionthereof, and/or logic implemented in either hardware circuitry orsoftware, or a combination thereof. These can be varied and are notlimited to the examples or descriptions provided.

In some embodiments, modules 959 of FIG. 9, or one or more of theircomponents, or any process or device described herein, can be incommunication (e.g., wired or wirelessly) with a mobile device, such asa mobile phone or computing device, or can be disposed therein.

In some cases, a mobile device, or any networked computing device (notshown) in communication with one or more modules 959 or one or more ofits/their components (or any process or device described herein), canprovide at least some of the structures and/or functions of any of thefeatures described herein. As depicted in the above-described figures,the structures and/or functions of any of the above-described featurescan be implemented in software, hardware, firmware, circuitry, or anycombination thereof. Note that the structures and constituent elementsabove, as well as their functionality, may be aggregated or combinedwith one or more other structures or elements. Alternatively, theelements and their functionality may be subdivided into constituentsub-elements, if any. As software, at least some of the above-describedtechniques may be implemented using various types of programming orformatting languages, frameworks, syntax, applications, protocols,objects, or techniques. For example, at least one of the elementsdepicted in any of the figures can represent one or more algorithms. Or,at least one of the elements can represent a portion of logic includinga portion of hardware configured to provide constituent structuresand/or functionalities.

For example, modules 959 or one or more of its/their components, or anyprocess or device described herein, can be implemented in one or morecomputing devices (i.e., any mobile computing device, such as a wearabledevice, such as a hat or headband, or mobile phone, whether worn orcarried) that include one or more processors configured to execute oneor more algorithms in memory. Thus, at least some of the elements in theabove-described figures can represent one or more algorithms. Or, atleast one of the elements can represent a portion of logic including aportion of hardware configured to provide constituent structures and/orfunctionalities. These can be varied and are not limited to the examplesor descriptions provided.

As hardware and/or firmware, the above-described structures andtechniques can be implemented using various types of programming orintegrated circuit design languages, including hardware descriptionlanguages, such as any register transfer language (“RTL”) configured todesign field-programmable gate arrays (“FPGAs”), application-specificintegrated circuits (“ASICs”), multi-chip modules, or any other type ofintegrated circuit.

For example, modules 959 or one or more of its/their components, or anyprocess or device described herein, can be implemented in one or morecomputing devices that include one or more circuits. Thus, at least oneof the elements in the above-described figures can represent one or morecomponents of hardware. Or, at least one of the elements can represent aportion of logic including a portion of a circuit configured to provideconstituent structures and/or functionalities.

According to some embodiments, the term “circuit” can refer, forexample, to any system including a number of components through whichcurrent flows to perform one or more functions, the components includingdiscrete and complex components. Examples of discrete components includetransistors, resistors, capacitors, inductors, diodes, and the like, andexamples of complex components include memory, processors, analogcircuits, digital circuits, and the like, including field-programmablegate arrays (“FPGAs”), application-specific integrated circuits(“ASICs”). Therefore, a circuit can include a system of electroniccomponents and logic components (e.g., logic configured to executeinstructions, such that a group of executable instructions of analgorithm, for example, and, thus, is a component of a circuit).According to some embodiments, the term “module” can refer, for example,to an algorithm or a portion thereof, and/or logic implemented in eitherhardware circuitry or software, or a combination thereof (i.e., a modulecan be implemented as a circuit). In some embodiments, algorithms and/orthe memory in which the algorithms are stored are “components” of acircuit. Thus, the term “circuit” can also refer, for example, to asystem of components, including algorithms. These can be varied and arenot limited to the examples or descriptions provided. Further, none ofthe above-described implementations are abstract, but rather contributesignificantly to improvements to functionalities and the art ofcomputing devices.

Although the foregoing examples have been described in some detail forpurposes of clarity of understanding, the above-described inventivetechniques are not limited to the details provided. There are manyalternative ways of implementing the above-described inventiontechniques. The disclosed examples are illustrative and not restrictive.

1. A method comprising: ingesting data representing a dataset into adataset consolidation system including a processor and memory, thedataset including a tabular data arrangement associated with a firstdata format; formatting the dataset into a second data arrangementhaving a second format, the second data arrangement being a graph dataarrangement generated using linked data and the dataset being convertedfrom the first format into the second format; identifying one or morereferential indicators for a first set of the dataset formatted ineither the first data arrangement or second data arrangement, or both;analyzing a second set of multiple different datasets to determine asubset of equivalent referential indicators in the second set that areequivalent to the one or more referential indicators for the first set;transmuting one or more associations between equivalent referentialindicators in the subset of equivalent referential indicators and theone or more referential indicators for the first set; forming one ormore transmuted associations based on the equivalent referentialindicators to generate a merged dataset of linked data; and receiving aquery to access data in the merged dataset, the query implementingeither a relational-based query language or a graph-based querylanguage, or both.
 2. The method of claim 1 wherein the second formatcomprises an atomized data format.
 3. The method of claim 2 wherein theatomized data format comprises one or more triples.
 4. The method ofclaim 1 further comprises: performing one or more auxiliary queries. 5.The method of claim 4 wherein performing the one or more auxiliaryqueries comprises: implementing at least one auxiliary query as alink-formative query configured to invoke formation an additional link.6. The method of claim 5 wherein formation of the additional link isformed as a created triple.
 7. The method of claim 5 further comprising:generating results to integrate into the merged dataset to form anenhanced dataset.
 8. The method of claim 1 wherein at least one of theone or more referential indicators includes a data value as a unit ofdata associated with a cell at a row and column, and the subset ofequivalent referential indicators includes the data value as the unit ofdata associated with a node in a graph of the linked data.
 9. The methodof claim 8 wherein the unit of data is associated with a layer dataspecifying a column node and a row node that are linked to the datavalue in the node.
 10. The method of claim 1 wherein receiving the queryincludes implementing either an SQL-equivalent query language or aSPARQL-equivalent query language, or both.
 11. A system comprising: amemory including executable instructions; and a processor, responsive toexecuting the instructions, is configured to: ingest data representing adataset into a dataset consolidation system including a processor andmemory, the dataset including a tabular data arrangement associated witha first data format; format the dataset into a second data arrangementhaving a second format, the second data arrangement being a graph dataarrangement generated using linked data and the dataset being convertedfrom the first format into the second format; identify one or morereferential indicators for a first set of the dataset formatted ineither the first data arrangement or second data arrangement, or both;analyze a second set of multiple different datasets to determine asubset of equivalent referential indicators in the second set that areequivalent to the one or more referential indicators for the first set;transmute one or more associations between equivalent referentialindicators in the subset of equivalent referential indicators and theone or more referential indicators for the first set; form one or moretransmuted associations based on the equivalent referential indicatorsto generate a merged dataset of linked data; and receive a query toaccess data in the merged dataset, the query implementing either arelational-based query language or a graph-based query language, orboth.
 12. The system of claim 11 wherein the second format comprises anatomized data format.
 13. The system of claim 12 wherein the atomizeddata format comprises one or more triples.
 14. The system of claim 11wherein the processor is further configured to: perform one or moreauxiliary queries.
 15. The system of claim 14 wherein a subset of theinstructions to cause the processor to perform the one or more auxiliaryqueries further causes the processor to: implement at least oneauxiliary query as a link-formative query configured to invoke formationan additional link.
 16. The system of claim 15 wherein formation of theadditional link is formed as a created triple.
 17. The system of claimwherein the processor is further configured to: generate results tointegrate into the merged dataset to form an enhanced dataset.
 18. Thesystem of claim 11 wherein at least one of the one or more referentialindicators includes a data value as a unit of data associated with acell at a row and column, and the subset of equivalent referentialindicators includes the data value as the unit of data associated with anode in a graph of the linked data.
 19. The system of claim 18 whereinthe unit of data is associated with a layer data specifying a columnnode and a row node that are linked to the data value in the node. 20.The system of claim 11 wherein a subset of the instructions to cause theprocessor to receive the query further causes the processor to implementeither an SQL-equivalent query language or a SPARQL-equivalent querylanguage, or both.